Équipe de Recherche DALI
نویسنده
چکیده
In this paper, we present a recent algorithm given by Ogita, Rump and Oishi [39] for accurately computing the sum of n floating point numbers. They also give a computational error bound for the computed result. We apply this algorithm in computing determinant and more particularly in computing robust geometric predicates used in computational geometry. We improve existing results that use either a multiprecision libraries or extended large accumulators.
منابع مشابه
Séro-agglutination rapide et macroscopique pour la recherche d'anticorps de la Fièvre Q. chez les animaux
متن کامل
Etude comparative des dosages colorimétriques du phosphore; recherche d'une methode de haute sensibilité applicable au dosage du phosphore organique dans les spots après chromatographie
متن کامل
Computational study on geometric and electronic properties of 3.6-carbazole based conjugated polymers
In this work, we present firstly a study based on the calculation of the local spin densities of radical cations, which is known as a good measure of reactivity for coupling reactions, to obtain a theoretical basis for the one-step formation of poly(3.6-carbazole) and derivatives. Then we detail a DFT theoretical study of the geometric and electronic properties of oligomers based on carbazole a...
متن کاملAdsorption of Anionic Dyes on Poly(N-vinylpyrrolidone) Modified Bentonite
A composite based on poly(N-vinylpyrrolidone) (PVP) and sodium bentonite was prepared by a simple method. Structural characterizations of the bentonite and the composite were performed by Fourier transform infrared spectroscopy (FTIR), X-ray diffraction (XRD) and thermogravimetric analysis (TGA). The TGA analysis showed a low loading of the polymer in the bentonite. XRD analysis confirmed a mod...
متن کامل